Finding Proofs in Tarskian Geometry
نویسندگان
چکیده
منابع مشابه
OTTER Proofs in Tarskian Geometry
We report on a project to use OTTER to find proofs of the theorems in Tarskian geometry proved in Szmielew’s part (Part I) of [9]. These theorems start with fundamental properties of betweenness, and end with the development of geometric definitions of addition and multiplication that permit the representation of models of geometry as planes over Euclidean fields, or over real-closed fields in ...
متن کاملFinding proofs and checking proofs
The classic dichotomy between proof discovery and proof presentation resurfaces in automated deduction. The LCF style of theorem proving offers a promising way to integrate formal deductive proof with higher-level algorithmic or heuristic forms of mathematical activity. One way of dealing with the potential inefficiency of a reduction to a formal deductive system is to exploit the separation of...
متن کاملFinding Simple Proofs in Logic Calculi
The design of search-guiding heuristics for theorem provers centers on minimizing the time required to nd any proof. Mathematicians, however, are also interested in simple proofs. Relevant simplicity criteria like proof length, for instance, hardly play a role in the design of heuristics. In this report we present heuristics designed to nd simple proofs and empirically evaluate their performanc...
متن کاملFinding Counter Examples in Induction Proofs
This paper addresses a problem arising in automated proof of invariants of transition systems, for example transition systems modelling distributed programs. Most of the time, the actual properties we want to prove are too weak to hold inductively, and auxiliary invariants need to be introduced. The problem is how to find these extra invariants. We propose a method where we find minimal counter...
متن کاملFinding Computational Content in Classical Proofs
We illustrate the effectiveness of proof transformations which expose the computational content of classical proofs even in cases where it is not apparent. We state without proof a theorem that these transformations apply to proofs in a fragment of type theory and discuss their implementation in Nuprl. We end with a discussion of the applications to Higman's lemma [13, 21, 10] by the second aut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2016
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-016-9392-2